Datalog+/-: Questions and Answers

نویسندگان

  • Georg Gottlob
  • Thomas Lukasiewicz
  • Andreas Pieris
چکیده

• What is Datalog± and what are its advantages? Datalog± is a rule-based formalism that combines the advantages of logic programming in Datalog with features for expressing ontological knowledge and advanced data modeling constraints. Datalog± provides a uniform framework for query answering and reasoning with incomplete data. It generalizes disparate other KR formalisms such as plain Datalog, description logics (DLs), in particular, DL-Lite and EL, F-Logic Lite, highly relevant fragments of UML class diagrams, data-exchange formalisms, graph query languages such as SPARQL, and so on. Datalog± is a conceptually very simple and clear cut formalism that extends plain Datalog with features such as existential quantifiers, equalities, and the falsum (⊥) in rule heads and, at the same time, restricts the rule syntax so as to achieve decidability and, when required, tractability. Its closeness to logic programming allowed us to enrich it by non-monotonic negation under the stratified, well-founded, and stable model semantics.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Datalog as a Query Language for Data Exchange Systems

The class of unions of conjunctive queries (UCQ) has been shown to be particularly well-behaved for data exchange; its certain answers can be computed in polynomial time (in terms of data complexity). However, this is not the only class with this property; the certain answers to any DATALOG program can also can be computed in polynomial time. The problem is that both UCQ and DATALOG do not allo...

متن کامل

Efficiently Computing Provenance Graphs for Queries with Negation

Explaining why an answer is in the result of a query or why it is missing from the result is important for many applications including auditing, debugging data and queries, and answering hypothetical questions about data. Both types of questions, i.e., why and why-not provenance, have been studied extensively. In this work, we present the first practical approach for answering such questions fo...

متن کامل

Complexity of the Stable Model Semantics for Queries on Incomplete Databases

We study the complexity of consistency checking and query answering on incomplete databases for languages ranging from non-recursive Datalog to disjunctive Datalog with negation under the stable model semantics. We consider both possible and certain answers and both closedand open-world interpretation of C-databases with and without conditions. By reduction to stable models of logic programs we...

متن کامل

A General Framework for Inconsistency-tolerant Query Answering in Datalog +/-

Inconsistency management in knowledge bases is an important problem that has beenstudied for a long time. During the recent years, additional interest in this topic has been sparkedwith the advent of the Semantic Web. In this paper, we study different semantics for query answer-ing in inconsistent Datalog+/– ontologies. Datalog+/– is a family of ontology languages that is inpart...

متن کامل

Efficient Execution of Recursive Integration Plans

Information integration systems provide a uniform query interface to a set of sources. One of the key challenges for an information integration system is to provide maximally complete answers to user queries and to execute user queries efficiently. We describe an approach to map re-cursive datalog programs into a streaming, data-flow execution system. We show that our method can be used in conj...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014